Application of ACO to Disentangle Max-Min MDVRP Using Clustering Technique
نویسنده
چکیده
In this paper the ACO (Ant colony optimization) technique of Swarm Intelligence has been used to solve an interesting class of problem. This is an optimization technique which is used to solve max-min MDVRP. Unlike the traditional MDVRP which focuses on minimizing the distance travelled by the vehicle, this technique focuses on minimizing the maximum distance travelled by the vehicle. To achieve this level of optimization 2-opt technique has been used.
منابع مشابه
An ant colony optimization technique for solving min-max Multi-Depot Vehicle Routing Problem
The Multi-Depot Vehicle Routing Problem (MDVRP) involves minimizing the total distance traveled by vehicles originating from multiple depots so that the vehicles together visit the specified customer locations (or cities) exactly once. This problem belongs to a class of Nondeterministic Polynomial Hard (NP Hard) problems and has been used in literature as a benchmark for development of optimiza...
متن کاملMulti-Phase Meta-Heuristic for Multi-Depots Vehicle Routing Problem
In this work, we present a multi-phase hybrid algorithm based on clustering to solve the multi-depots vehicle routing problem (MDVRP). The proposed algorithm initially adopts K-means algorithm to execute the clustering analyses, which take the depots as the centroids of the clusters, for the all customers of MDVRP, then implements the local depth search using the Shuffled Frog Leaping Algorithm...
متن کاملSolving Min-Max Multi-Depot Vehicle Routing Problem∗
The Multi-Depot Vehicle Routing Problem (MDVRP) is a generalization of the Single-Depot Vehicle Routing Problem (SDVRP) in which vehicle(s) start from multiple depots and return to their depots of origin at the end of their assigned tours. The traditional objective in MDVRP is to minimize the sum of all tour lengths, and existing literature handles this problem with a variety of assumptions and...
متن کاملAdaptive Color Image Segmentation Using Fuzzy Min-Max Clustering
This paper proposes a novel system for color image segmentation called “Adaptive color image segmentation using fuzzy min-max clustering (ACISFMC)”. The present work is an application of Simpson’s fuzzy min-max neural network (FMMN) clustering algorithm. ACISFMC uses a multilayer perceptron (MLP) like network which perform color image segmentation using multilevel thresholding. Threshold values...
متن کاملReview of Bio-inspired Algorithm in Wireless Sensor Network: ACO, ACO using RSSI and Ant Clustering
Biological inspired routing or bio-inspired routing is a new heuristic routing algorithm in wireless sensor network, which is inspired from biological activities of insects. ACO is ants’ inspired routing algorithm ACO, which has the ability to find shortest path and re-establish the new route in the case of route failure. In order to improve the network performance i.e. increase network lifetim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013